Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions
نویسندگان
چکیده
We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes a recent result of Klazar and Noy in perfect matchings. By factorizing our involution through bijections between set partitions and some path diagrams we obtain the continued fraction expansions of the corresponding ordinary generating functions.
منابع مشابه
k-DISTANT CROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS
We define and consider k-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng (Electronic J. Combinatorics 2006, research paper 33), we show that the joint distribution of k-distant crossings and nestings is symmetric. We also study the...
متن کاملCrossings and Nestings of Two Edges in Set Partitions
Let π and λ be two set partitions with the same number of blocks. Assume π is a partition of [n]. For any integer l,m ≥ 0, let T (π, l) be the set of partitions of [n+ l] whose restrictions to the last n elements are isomorphic to π, and T (π, l,m) the subset of T (π, l) consisting of those partitions with exactly m blocks. Similarly define T (λ, l) and T (λ, l,m). We prove that if the statisti...
متن کاملCrossings and Nestings for Arc-Coloured Permutations and Automation
Symmetric joint distribution between crossings and nestings was established in several combinatorial objects. Recently, Marberg extended Chen and Guo’s result on coloured matchings to coloured set partitions following a multi-dimensional generalization of the bijection and enumerative methods from Chen, Deng, Du, Stanley, and Yan. We complete the study for arc-coloured permutations by establish...
متن کاملOn Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
Let M, N be two matchings on [2n] (possibly M = N) and for an integer l ≥ 0 let T (M, l) be the set of those matchings on [2n + 2l] which can be obtained from M by successively adding l times in all ways the first edge, and similarly for T (N, l). Let s, t ∈ {cr, ne} where cr is the statistic of the number of crossings (in a matching) and ne is the statistic of the number of nestings (possibly ...
متن کاملCrossings and Nestings in Colored Set Partitions
Chen, Deng, Du, Stanley, and Yan introduced the notion of k-crossings and k-nestings for set partitions, and proved that the sizes of the largest k-crossings and k-nestings in the partitions of an n-set possess a symmetric joint distribution. This work considers a generalization of these results to set partitions whose arcs are labeled by an r-element set (which we call r-colored set partitions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006